Graph Based Representation of Dynamic Planning
نویسندگان
چکیده
Dynamic planning concerns the planning and execution of actions in a dynamic, real world environment. Its goal is to take into account changes generated by unpredicted events occurred during the execution of actions. In this paper we develop the theoretic model of dynamic planning presented in [12]. This model proposes a graph representation of possible, efficient and best plans of agents acting in a dynamic environment. Agents have preferences among consequences of their possible actions performed to reach a fixed goal. Environmental changes and their consequences are taken into account by several approaches proposed in the so-called "reactive planning" field. The dynamic planning approach we propose, handles in addition changes on agents ́ preferences and on their methods to evaluate them; it is modeled as a multi-objective dynamic programming problem.
منابع مشابه
Generating Parallel Plans Based on Planning Graph Analysis of Predicate/Transition Nets
Multi-agent systems often exhibit rich parallelism among agents. It is desirable in a multi-agent planner to explicitly represent parallel actions. This paper presents an approach for generating parallel execution plans based on the planning graph analysis. Instead of representing a planning problem by STRIPS operators, we model multi-agent planning domains using Predicate/Transition (PrT) nets...
متن کاملBridging the Gap Between Semantic Planning and Continuous Control for Mobile Manipulation Using a Graph-Based World Representation
We present our ongoing efforts to create a mobile manipulation database tool, a flexible multi-modal representation supporting persistent life-long adaptation for autonomous service robots in every-day environments. Its application to a prototypical domain illustrates how it provides symbol grounding to a reasoning system capable of learning new concepts, couples semantic planning with whole-bo...
متن کاملdominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملRole of Voronoi Diagram Approach in Path Planning
Graph theoretic approaches plays important role in the path planning problems. The usefulness of Graph Theoretic approaches mainly the voronoi diagram is provided for the path planning in static and dynamic environment in this paper. Voronoi Diagram plays important role in computing the optimal path between the source & destination in static as well as dynamic environment. So, through the liter...
متن کاملOpen pit limit optimization using dijkstra’s algorithm
In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the p...
متن کامل